AN ALGORITHM TO COMPUTE THE DEGREE OF A DICKSON POLYNOMIAL
نویسندگان
چکیده
In this study, we describe an algorithm that computes the degree of a Dickson Polynomial First Kind from its known value at point. Our is based on mathematical relation between Polynomials and Chebyshev Kind.
منابع مشابه
extensions of some polynomial inequalities to the polar derivative
توسیع تعدادی از نامساوی های چند جمله ای در مشتق قطبی
15 صفحه اولAn Algorithm to Compute the Complexity of a Static Production Planning (RESEARCH NOTE)
Complexity is one of the most important issues of any production planning. The increase in complexity of production planning can cause inconsistency between a production plan and an actual outcome. The complexity generally can be divided in two categories, the static complexity and the dynamic complexity, which can be computed using the ant ropy formula. The formula considers the probability of...
متن کاملthe aesthetic dimension of howard barkers art: a frankfurtian approach to scenes from an execution and no end of blame
رابطه ی میانِ هنر و شرایطِ اجتماعیِ زایش آن همواره در طولِ تاریخ دغدغه ی ذهنی و دل مشغولیِ اساسیِ منتقدان و نیز هنرمندان بوده است. از آنجا که هنر در قفس آهنیِ زندگیِ اجتماعی محبوس است، گسترش وابستگیِ آن با نهاد ها و اصولِ اجتماعی پیرامون، صرفِ نظر از هم سو بودن و یا غیرِ هم سو بودنِ آن نهاد ها، امری اجتناب ناپذیر به نظر می رسد. با این وجود پدیدار گشتنِ چنین مباحثِ حائز اهمییتی در میان منتقدین، با ظهورِ مکتب ما...
A p-adic algorithm to compute the Hilbert class polynomial
Classicaly, the Hilbert class polynomial P∆ ∈ Z[X] of an imaginary quadratic discriminant ∆ is computed using complex analytic techniques. In 2002, Couveignes and Henocq [5] suggested a p-adic algorithm to compute P∆. Unlike the complex analytic method, it does not suffer from problems caused by rounding errors. In this paper we complete the outline given in [5] and we prove that, if the Genera...
متن کاملAn Algorithm to Compute
The following problem is addressed: given square matrices A and B, compute the smallest such that A + E and B + F have a common eigenvalue for some E, F with max(‖E‖2, ‖F‖2) ≤ . An algorithm to compute this quantity to any prescribed accuracy is presented, assuming that eigenvalues can be computed exactly.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Eskis?ehir teknik u?niversitesi bilim ve teknoloji dergisi b- teorik bilimler
سال: 2021
ISSN: ['2667-419X']
DOI: https://doi.org/10.20290/estubtdb.841749